STRUCTURED DESIGN.STEVENS WP; MYERS GJ; CONSTANTINE LL et al.1974; I.B.M. SYST. J.; U.S.A.; DA. 1974; VOL. 13; NO 2; PP. 115-139; BIBL. 12 REF.Article

MEASURES OF PROGRAMMING COMPLEXITYKITCHENHAM BA.1981; ICL TECHNICAL JOURNAL; ISSN 0142-1557; GBR; DA. 1981; VOL. 2; NO 3; PP. 298-316; BIBL. 13 REF.Article

DEGREES OF COMPUTATIONAL COMPLEXITY = DEGRES DE COMPLEXITE DE CALCULENDERTON HB.1972; J. COMPUTER SYST. SCI.; U.S.A.; DA. 1972; VOL. 6; NO 5; PP. 389-396; BIBL. 10 REF.Serial Issue

A THEORY OF SMALL PROGRAM COMPLEXITYMAGEL K.1982; SIGPLAN NOT.; ISSN 0362-1340; USA; DA. 1982; VOL. 17; NO 3; PP. 37-45; BIBL. 20 REF.Article

TWO DIMENSIONS OF PROGRAM COMPLEXITYCHAUDHARY BD; SAHASRABUDDHE HV.1983; INTERNATIONAL JOURNAL OF MAN-MACHINE STUDIES; ISSN 0020-7373; GBR; DA. 1983; VOL. 18; NO 5; PP. 505-511; BIBL. 17 REF.Article

MINIMAL-PROGRAM COMPLEXITY OF PSEUDO-RECURSIVE AND PSEUDO-RANDOM SEQUENCES.DALEY RP.1975; MATH. SYST. THEORY; U.S.A.; DA. 1975; VOL. 9; NO 1; PP. 83-94; BIBL. 23 REF.Article

PROOF OF A STRUCTURED PROGRAM : "THE SIEVE OF ERATOSTHENES"HOARE CAR.1972; COMPUTER J.; G.B.; DA. 1972; VOL. 15; NO 4; PP. 321-325; BIBL. 11 REF.Serial Issue

SEMANTIC DECOMPOSITION OF COMPUTER PROGRAMS: AND AID TO PROGRAM TESTING.ZISLIS PM.1975; ACTA INFORMAT.; ALLEM.; DA. 1975; VOL. 4; NO 3; PP. 245-269; BIBL. 19 REF.Article

DEFINING SOFTWARE SCIENCE COUNTING STRATEGIESSALT NF.1982; SIGPLAN NOT.; ISSN 0362-1340; USA; DA. 1982; VOL. 17; NO 3; PP. 58-67; BIBL. 11 REF.Article

PARALLELISM IN COMPARISON PROBLEMS.VALIANT LG.1975; S.I.A.M. J. COMPUTG; U.S.A.; DA. 1975; VOL. 4; NO 3; PP. 348-355; BIBL. 7 REF.Article

A CRITICAL EXAMINATION OF SOFTWARE SCIENCELASSEZ JL; VAN DER KNIJFF D; SHEPHERD J et al.1981; J. SYST. SOFTW.; ISSN 0164-1212; USA; DA. 1981; VOL. 2; NO 2; PP. 105-112; BIBL. 19 REF.Article

A THEORY OF PROGRAM SIZE FORMALLY IDENTICAL TO INFORMATION THEORY.CHAITIN GJ.1975; J. ASS. COMPUTG MACHIN.; U.S.A.; DA. 1975; VOL. 22; NO 3; PP. 329-340; BIBL. 1 P.Article

ZUR PROGRAMMKOMPLEXITAET REKURSIV AUFZAEHLBARER MENGEN. = SUR LA COMPLEXITE DE PROGRAMME DES ENSEMBLES DENOMBRABLES RECURSIFSHECKER HD.1976; Z. MATH. LOGIK GRUNDL. MATH.; DTSCH.; DA. 1976; VOL. 22; NO 3; PP. 239-244; BIBL. 9 REF.Article

UNE GENERALISATION DE LA NOTION D'ENSEMBLE IMMUNE.FLAJOLET P; STEYAERT JM.1974; REV. FR. AUTOMAT. INFORMAT. RECH. OPERAT., R; FR.; DA. 1974; VOL. 8; NO 1; PP. 37-48; ABS. ANGL.; BIBL. 15 REF.Article

SUBRECURSIVE PROGRAMMING LANGUAGES. I. EFFICIENCY AND PROGRAM STRUCTURECONSTABLE RL; BORODIN AB.1972; J. ASS. COMPUTG MACHIN.; U.S.A.; DA. 1972; VOL. 19; NO 3; PP. 526-568; BIBL. 27 REF.Serial Issue

SOFTWARE SCIENCE REVISITED: A CRITICAL ANALYSIS OF THE THEORY AND ITS EMPIRICAL SUPPORTSHEN VY; CONTE SD; DUNSMORE HE et al.1983; IEEE TRANSACTIONS ON SOFTWARE ENGINEERING; ISSN 0098-5589; USA; DA. 1983; VOL. 9; NO 2; PP. 155-165; BIBL. 48 REF.Article

FOUNDATIONS AND EXPERIMENTS IN SOFTWARE SCIENCEBESER N.1982; PERFORM. EVAL. REV.; ISSN 0163-5999; USA; DA. 1982; VOL. 11; NO 3; PP. 48-72; BIBL. 23 REF.Article

ACCESSIBILITY OF VALUES AS A DETERMINANT OF RELATIVE COMPLEXITY IN ALGEBRASLYNCH NA.1982; J. COMPUT. SYST. SCI.; ISSN 0022-0000; USA; DA. 1982; VOL. 24; NO 1; PP. 101-113; BIBL. 5 REF.Article

EVALUATING STRUCTURED COBOL AS A SOFTWARE ENGINEERING DISCIPLINERYGE S.1981; DATA BASE; ISSN 0095-0033; USA; DA. 1981; VOL. 12; NO 3; PP. 3-6; BIBL. 6 REF.Article

INDEPENDENCE RESULTS IN COMPUTER SCIENCE.JOSEPH D; YOUNG P.1981; J. COMPUT. SYST. SCI.; ISSN 0022-0000; USA; DA. 1981; VOL. 23; NO 2; PP. 205-222; BIBL. 37 REF.Conference Paper

LOOP-PROGRAMS AND POLYNOMIALLY COMPUTABLE FUNCTIONSAMIHUD A; CHOUEKA Y.1981; INT. J. COMPUT. MATH.; ISSN 0020-7160; GBR; DA. 1981; VOL. 9; NO 3; PP. 195-205; BIBL. 3 REF.Article

SOFTWARE DESIGN TESTABILITY ANALYSISYIN BH.1981; HAWAII INTERNATIONAL CONFERENCE ON SYSTEM SCIENCES. 14/1981/HONOLULU HI; USA; S.L.: WESTERN PERIODICALS; DA. 1981; PP. 66-73; BIBL. 8 REF.Conference Paper

A QUALITATIVE JUSTIFICATION FOR A MEASURE OF PROGRAM CLARITYGORDON RD.1979; I.E.E.E. TRANS. SOFTWARE ENGNG; USA; DA. 1979; VOL. 5; NO 2; PP. 121-128; BIBL. 12 REF.Article

SPECIFYING PROGRAM STRUCTURE THROUGH SEQUENCE RELATIONSHIPS.MIDDLETON T.1977; SIGPLAN NOT.; U.S.A.; DA. 1977; VOL. 12; NO 10; PP. 43-47; BIBL. 1 REF.Article

ETUDE DE LA COMPLEXITE DE LA REALISATION DES FONCTIONS AVEC UNE CASCADE UNIDIMENSIONNELLE DE MODULESKORNEJCHUK VI; TARASENKO VP; TESLENKO AK et al.1977; AVTOMAT. VYCHISLIT. TEKH., LATV. S.S.R.; S.S.S.R.; DA. 1977; NO 5; PP. 5-11; BIBL. 7 REF.Article